Construction and Local Routing for Angle-Monotone Graphs
نویسندگان
چکیده
منابع مشابه
Angle-Monotone Graphs: Construction and Local Routing
A geometric graph in the plane is angle-monotone of width γ if every pair of vertices is connected by an angle-monotone path of width γ, a path such that the angles of any two edges in the path differ by at most γ. Angle-monotone graphs have good spanning properties. We prove that every point set in the plane admits an angle-monotone graph of width 90◦, hence with spanning ratio √ 2, and a subq...
متن کاملGabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
A geometric graph is angle-monotone if every pair of vertices has a path between them that—after some rotation—is xand ymonotone. Angle-monotone graphs are √ 2-spanners and they are increasing-chord graphs. Dehkordi, Frati, and Gudmundsson introduced anglemonotone graphs in 2014 and proved that Gabriel triangulations are angle-monotone graphs. We give a polynomial time algorithm to recognize an...
متن کاملOnion routing circuit construction via latency graphs
The use of anonymity-based infrastructures and anonymisers is a plausible solution to mitigate privacy problems on the Internet. Tor (short for The onion router) is a popular low-latency anonymity system that can be installed as an end-user application on a wide range of operating systems to redirect the traffic through a series of anonymising proxy circuits. The construction of these circuits ...
متن کاملNon maximal cyclically monotone graphs and construction of a bipotential for the Coulomb’s dry friction law
We show a surprising connexion between a property of the inf convolutions of a family of convex lower semicontinuous functions and the fact that intersections of maximal cyclically monotone graphs are the critical set of a bipotential. We then extend the results from [4] to bipotentials convex covers, generalizing the notion of a bi-implicitly convex lagrangian cover. As an application we prove...
متن کاملL-Graphs and Monotone L-Graphs
An L-segment consists of a horizontal and a vertical straight line which form an L. In an L-embedding of a graph, each vertex is represented by an Lsegment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each L-segment in an Lembedding lies on a straight line, we call it a monotone L-embedding. In this paper we give a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2019
ISSN: 1526-1719
DOI: 10.7155/jgaa.00494